Encapsulated Hierarchical Graphs , Graph Types , and Meta

نویسنده

  • Gregor Engels
چکیده

Currently existing graph grammar-based speciication languages have serious problems with supporting any kind of \speciication-in-the-large" activities. More precisely , they have deeciences with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an innnite number of schema, meta-schema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar spec-iication language where in addition information hiding aspects like explicit export and import interfaces are expressible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

Hierarchical graph transformations with meta-rules

This paper is concerned with hierarchical graph models and graph transformation rules, specifically with the problem of transforming a part of graph which may contain subordinated nodes and edges. Meta-rules are proposed as a formal way of representing transformations which remove or duplicate a node along with its contents. The paper discusses the behaviour of meta-rules when applied to differ...

متن کامل

De nition of an Encapsulated Hierarchical Graph Data Model Static Aspects

Graph grammars have been successfully used as a formalism for the speci cation of realistic problems but, as far as speci cation-in-the-large activities are concerned, they still have some de ciencies. In particular, most of them only support the use of at graphs, whereas for certain applications hierarchical graphs would be a more suitable modelling tool. Furthermore, there is still the need f...

متن کامل

De nition of an Encapsulated Hierarchical Graph Data

Graph grammars have been successfully used as a formalism for the speciication of realistic problems but, as far as speciication-in-the-large activities are concerned, they still have some deeciencies. In particular, most of them only support the use of at graphs, whereas for certain applications hierarchical graphs would be a more suitable modelling tool. Furthermore, there is still the need f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995